NC Algorithms for Recognizing Chordal Graphs and k Trees
نویسندگان
چکیده
We present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. Our algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n3m) processors. Furthermore, our characterizations for chordal graphs and k trees are interesting in their own right.
منابع مشابه
Complement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملHardness Results and Efficient Algorithms for Graph Powers
The k-th power H of a graph H is obtained from H by adding new edges between every two distinct vertices having distance at most k in H . Lau [Bipartite roots of graphs, ACM Transactions on Algorithms 2 (2006) 178–208] conjectured that recognizing k-th powers of some graph is NP-complete for all fixed k ≥ 2 and recognizing k-th powers of a bipartite graph is NP-complete for all fixed k ≥ 3. We ...
متن کاملClique Graphs of Chordal and Path Graphs
Clique graphs of chordal and path graphs are characterized. A special class of graphs named expanded trees is discussed. It consists of a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Diierent characterizations of expanded trees are...
متن کاملList Partitions of Chordal Graphs
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and l cliques. This is a natural generalization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k ≤ 2 and l ≤ 2. (Split graphs have k = l = 1.) In this paper we expand our focus and consider generalM -partitions, also known as trigraph homomorphism...
متن کاملFast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 37 شماره
صفحات -
تاریخ انتشار 1988